Planar lattice gases with nearest-neighbor exclusion
نویسندگان
چکیده
منابع مشابه
Density functional theory for nearest-neighbor exclusion lattice gases in two and three dimensions.
To speak about fundamental measure theory obliges us to mention dimensional crossover. This feature, inherent to the systems themselves, was incorporated in the theory almost from the beginning. Although at first it was thought to be a consistency check for the theory, it rapidly became its fundamental pillar, thus becoming the only density functional theory which possesses such a property. It ...
متن کاملFirst-order phase transition in a driven lattice gas with nearest-neighbor exclusion
A lattice gas with infinite repulsion between particles separated by ≤ 1 lattice spacing, and nearest-neighbor hopping dynamics, is subjected to a drive that favors movement along the +x direction. The equilibrium (zero drive) transition to a phase with sublattice ordering, known to be continuous, turns discontinuous, and shifts to lower density with increasing bias. In the ordered nonequilibri...
متن کاملFirst- and second-order phase transitions in a driven lattice gas with nearest-neighbor exclusion.
A lattice gas with infinite repulsion between particles separated by < or = 1 lattice spacing, and nearest-neighbor hopping dynamics, is subject to a drive favoring movement along one axis of the square lattice. The equilibrium (zero drive) transition to a phase with sublattice ordering, known to be continuous, shifts to lower density, and becomes discontinuous for large bias. In the ordered no...
متن کاملa lattice based nearest neighbor classifier for anomaly intrusion detection
as networking and communication technology becomes more widespread, thequantity and impact of system attackers have been increased rapidly. themethodology of intrusion detection (ids) is generally classified into two broadcategories according to the detection approaches: misuse detection and anomalydetection. in misuse detection approach, abnormal system behavior is defined atfirst, and then an...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 1999
ISSN: 0218-0006,0219-3094
DOI: 10.1007/bf01608783